Independent component analysis and (simultaneous) third-order tensor diagonalization
نویسندگان
چکیده
Comon’s well-known scheme for independent component analysis (ICA) is based on the maximal diagonalization, in a least-squares sense, of a higher-order cumulant tensor. In a previous papr, we proved that for fourth-order cumulants, the computation of an elementary Jacobi rotation is equivalent to the computation of the best rank-1 approximation of a fourth-order tensor. In this paper, we show that for third-order tensors, the computation of an elementary Jacobi-rotation is again equivalent to a best rank-1 approximation; however, here, it is a matrix that has to be approximated. This favorable computational load makes it attractive to do “something third-order-like” for fourth-order cumulant tensors as well. We show that simultaneous optimal diagonalization of “third-order tensor slices” of the fourth-order cumulant is a suitable strategy. This “simultaneous third-order tensor diagonalization” approach (STOTD) is similar in spirit to the efficient JADE-algorithm.
منابع مشابه
Non-orthogonal tensor diagonalization
Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It has a link to an approximate joint diagonalization (AJD) of a set of matrices. In this paper, we derive (1) a new algorithm for a symmetric AJD, which is called two-sided symmetric diagonal...
متن کاملSimultaneous Matrix Diagonalization: the Overcomplete Case
Many algorithms for Independent Component Analysis rely on a simultaneous diagonalization of a set of matrices by means of a nonsingular matrix. In this paper we provide means to determine the matrix when it has more columns than rows.
متن کاملGlobally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651–672, 2013], we prove its global convergence for simultaneous orthogonal diagonalization of symmetric matrices and 3rd-order tensors. We also propose a new Jacobi-based algorithm in the gen...
متن کاملA generalization of joint-diagonalization criteria for source separation
In the field of blind source separation, joint-diagonalization-based approaches constitute an important framework, leading to useful algorithms such as the popular joint approximate diagonalization of eigenmatrices (JADE) and simultaneous third-order tensor diagonalization (STOTD) algorithms. However, they are often restricted to the case of cumulants of order four. In this paper, we extend the...
متن کاملDimensionality reduction in higher - order signal processing and rank - ( R 1 , R 2 , . . . , RN ) reduction in multilinear algebra
In this paper we review a multilinear generalization of the singular value decomposition and the best rank-(R1, R2, . . . , RN) approximation of higher-order tensors. We show that they are important tools for dimensionality reduction in higher-order signal processing. We discuss applications in independent component analysis, simultaneous matrix diagonalization and subspace variants of algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 49 شماره
صفحات -
تاریخ انتشار 2001